102. Binary Tree Level Order Traversal - LeetCode Solution

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def levelOrder(self, root: TreeNode) -> List[List[int]]:
        if not root:
            return 
        
        q = []
        
        ans = []
        q.append(root)
        q.append(None)
        s = []
        
        count = 0
        
        while len(q)!= 0:
            root = q.pop(0)
            
            
            if root==None:
                count+=1
                if count==2:
                    break
                ans.append(s)
                s = []
                q.append(None)
                continue
                
            else:

                count = 0 

                s.append(root.val)

                if root.left:
                    q.append(root.left)


                if root.right:
                    q.append(root.right)
            

        return ans